Accurate Symmetric Eigenreduction by a Jacobi Method
نویسنده
چکیده
Acknowledgement I would like to thank my mentor Prof. Dr. Krešimir Veseli´c for introducing me to the exciting field of relative error analysis, for devoting to me a lot of his time, and for sharing with me so many of his ideas. I also thank my colleagues Eberhard Pietzsch, Zlatko Drmač und Xiaofeng Wang for the possibility to check my ideas in numerous discussions, and Prof. his valuable and detailed remarks.
منابع مشابه
A Note on the Accuracy of Symmetric Eigenreduction Algorithms
We present some experimental results illustrating the fact that on highly ill–conditioned Hermitian matrices the relative accuracy of computed small eigenvalues by QR eigenreduction may drastically depend on the initial permutation of the rows and columns. Mostly there was an “accurate” permutation, but there does not seem to be an easy method to get at it. For banded matrices, like those from ...
متن کاملImplicit standard Jacobi gives high relative accuracy
We prove that the Jacobi algorithm applied implicitly on a decomposition A = XDXT of the symmetric matrix A, where D is diagonal, and X is well conditioned, computes all eigenvalues of A to high relative accuracy. The relative error in every eigenvalue is bounded by O(εκ(X)), where ε is the machine precision and κ(X) ≡ ‖X‖2 · ‖X−1‖2 is the spectral condition number of X . The eigenvectors are a...
متن کاملNorges Teknisk-naturvitenskapelige Universitet Efficient Time-symmetric Simulation of Torqued Rigid Bodies Using Jacobi Elliptic Functions
If the three moments of inertia are different from each other, the solution to the free rigid body (FRB) equations of motion is given in terms of Jacobi elliptic functions. Using the Arithmetic-Geometric mean algorithm, [1], these functions can be calculated efficiently and accurately. The overall approach yields a faster and more accurate numerical solution to the FRB equations compared to sta...
متن کاملComputation of Signature Symmetric Balanced Realizations
A new numerical scheme for computing balancing coordinate transformations for signature symmetric realizations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and hyperbolic Jacobi-type rotations is considered. Local quadratic convergence of th...
متن کاملJacobi's method is more accurate than QR
We show that Jacobi's method (with a proper stopping criterion) computes small eigenvalues of symmetric positive de nite matrices with a uniformly better relative accuracy bound than QR, divide and conquer, traditional bisection, or any algorithm which rst involves tridiagonalizing the matrix. In fact, modulo an assumption based on extensive numerical tests, we show that Jacobi's method is opti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992